A note on computational complexities of polynomial type
نویسنده
چکیده
We introduce a notion of a polynomial type complexity of a multivariate polynomial. We provide examples of polynomial type complexities, including the determinantal complexity. We present two algorithms (not very efficient) to construct test functions for lower bounds (or explicit obstructions) of a polynomial type complexity, one of them is based on Gröbner bases, the other uses the resultant of polynomials in many variables. If the ground field is C we show an algorithm to compute a polynomial type complexity. We discuss several questions related with these ideas. AMSC: 03D15, 68Q17, 13P25
منابع مشابه
Constructing elusive functions with help of evaluation mappings
We introduce a general concept of complexity and a polynomial type algebraic complexity of a polynomial mapping. The notion of polynomial type algebraic complexity encompasses the determinantal complexity. We analyze the relation between polynomial type algebraic complexities and elusive functions. We study geometric-algebraic properties of polynomial type computational complexities. We present...
متن کاملOn Bending Response of Doubly Curved Laminated Composite Shells Using Hybrid Refined Models
This paper presents a static analysis of laminated composite doubly-curved shells using refined kinematic models with polynomial and non-polynomial functions recently introduced in the literature. To be specific, Maclaurin, trigonometric, exponential and zig-zag functions are employed. The employed refined models are based on the equivalent single layer theories. A simply supported shell is sub...
متن کاملA Unified Approach for Design of Lp Polynomial Algorithms
By summarizing Khachiyan's algorithm and Karmarkar's algorithm forlinear program (LP) a unified methodology for the design of polynomial-time algorithms for LP is presented in this paper. A key concept is the so-called extended binary search (EBS) algorithm introduced by the author. It is used as a unified model to analyze the complexities of the existing modem LP algorithms and possibly, help ...
متن کاملSome results on the polynomial numerical hulls of matrices
In this note we characterize polynomial numerical hulls of matrices $A in M_n$ such that$A^2$ is Hermitian. Also, we consider normal matrices $A in M_n$ whose $k^{th}$ power are semidefinite. For such matriceswe show that $V^k(A)=sigma(A)$.
متن کاملEffects of Directional Subdividing on adaptive Grid-Embedding (RESEARCH NOTE)
The effects of using both directions and directional subdividing on adaptive gridembedding on the computational time and the number of grid points required for the same accuracy are considered. Directional subdividing is used from the beginning of the adaptation procedure without any restriction. To avoid the complication of unstructured grid, the semi-structured grid was used. It is used to so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1011.2887 شماره
صفحات -
تاریخ انتشار 2010